Search for: All records

Abstract Let$$p_{1},\ldots ,p_{n}$$ $p_1,\dots ,p_n$be a set of points in the unit square and let$$T_{1},\ldots ,T_{n}$$ $T_1,\dots ,T_n$be a set of$$\delta $$ $\delta$-tubes such that$$T_{j}$$ $T_j$passes through$$p_{j}$$ $p_j$. We prove a lower bound for the number of incidences between the points and tubes under a natural regularity condition (similar to Frostman regularity). As a consequence, we show that in any configuration of points$$p_{1},\ldots , p_{n} \in [0,1]^{2}$$ $p_1,\dots ,p_n\in {[0,1]}^2$along with a line$$\ell _{j}$$ ${\ell }_j$through each point$$p_{j}$$ $p_j$, there exist$$j\neq k$$ $j\ne k$for which$$d(p_{j}, \ell _{k}) \lesssim n^{-2/3+o(1)}$$ $d(p_j,{\ell }_k)\lesssim n^{-2/3+o\left(1\right)}$. It follows from the latter result that any set of$$n$$ $n$points in the unit square contains three points forming a triangle of area at most$$n^{-7/6+o(1)}$$ $n^{-7/6+o\left(1\right)}$. This new upper bound for Heilbronn’s triangle problem attains the high-low limit established in our previous work arXiv:2305.18253. 

Abstract An edge‐coloured graph is said to berainbowif no colour appears more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decade as they capture the essence of a number of interesting problems in a variety of areas. A particularly intensively studied question due to Keevash, Mubayi, Sudakov and Verstraëte from 2007 asks for the maximum possible average degree of a properly edge‐coloured graph on vertices without a rainbow cycle. Improving upon a series of earlier bounds, Tomon proved an upper bound of for this question. Very recently, Janzer–Sudakov and Kim–Lee–Liu–Tran independently removed the term in Tomon's bound, showing a bound of . We prove an upper bound of for this maximum possible average degree when there is no rainbow cycle. Our result is tight up to the term, and so, it essentially resolves this question. In addition, we observe a connection between this problem and several questions in additive number theory, allowing us to extend existing results on these questions for abelian groups to the case of non‐abelian groups.